Cyclic Convolution of Real Sequences: Hartley versus Fourier and New Schemes
نویسندگان
چکیده
Recently, new fast transforms (such as the discrete Hartley transform in particular) have been proposed which are best suited for the computation of cyclic convolution of real sequences. Two approaches using Fourier or Hartley transforms are first compared, showing that the recently proposed FFT algorithms for real data present a lower arithmetic complexity than the corresponding DHT-based approach. Improvements are made to both types of algorithms, leading to different trade offs between arithmetic and structural complexity. We also present a new Hartley Transform algorithm with lower arithmetic complexity than any previously published one.
منابع مشابه
Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real data
This paper highlights the possible tradeoffs between arithmetic and structural complexity when computing cyclic convolution of real data in the transform domain. Both Fourier and Hartley-based schemes are first explained in their usual form and then improved, either from the structural point of view or in the number of operations involved. Namely, we first present an algorithm for the in-place ...
متن کاملReal-valued fast Fourier transform algorithms
This tutorial paper describes the methods for constructing fast algorithms for the computation of the discrete Fourier transform (DFT) of a real-valued series. The application of these ideas to all the major fast Fourier transform (FFT) algorithms is discussed, and the various algorithms are compared. We present a new implementation of the real-valued split-radix FFT, an algorithm that uses few...
متن کاملFast Algorithms of Fourier and Hartleytransform and Their Implementation In
This paper is mainly intended as survey article on construction of fast algorithms for the computation of the discrete Fourier transform (DFT) and discrete Hartley transform (DHT), all in relation to discrete linear and cyclic convolution which are fundamental operations in many data processing tasks. The exposition prefers purely algebraic approach to explain the basic ideas in concise but cle...
متن کاملApplications of Generalized Convolutions Associated with the Fourier and Hartley Transforms
In this paper we present new generalized convolutions with weight-function associated with the Fourier and Hartley transforms, and consider applications. Namely, using the generalized convolutions, we construct normed rings on the space L(R), provide the sufficient and necessary condition for the solvability of a class of integral equations of convolution type, and receive the explicit solution...
متن کاملHarmonic Modeling of Inrush Current in Core Type Power Transformers Using Hartley Transform
This paper presents a new method for evaluation and simulation of inrush current in various transformers using operational matrices and Hartley transform. Unlike most of the previous works, time and frequency domain calculations are conducted simultaneously. Mathematical equations are first represented to compute the inrush current based on reiteration and then Hartley transform is used to stud...
متن کامل